Robust group strategy‐proofness

نویسندگان

چکیده

Strategy‐proofness (SP) is a sought‐after property in social choice functions because it ensures that agents have no incentive to misrepresent their private information at both the interim and ex post stages. Group strategy‐proofness (GSP), however, notion applied stage but not stage. Thus, we propose new of GSP, coined robust group (RGSP), which benefits by deviating from truth telling We show for provision public good Minimum Demand rule (Serizawa (1999)) satisfies RGSP when production possibilities set particular topological property. In problem allocating indivisible objects, an acyclicity condition on priorities necessary sufficient Deferred Acceptance satisfy RGSP, only Top Trading Cycles rule. For allocation divisible goods among with single‐peaked preferences (Sprumont (1991)), free disposal, replacement monotonic rules within class sequential allotment RGSP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group strategyproofness in queueing models

We examine the tradeoffs between two variants of group strategyproofness, efficiency and budget balance in queueing models. In general, group strategyproofness is incompatible with efficiency and budget balance. Weakening budget balance to feasibility, we show that the incompatibility persists with strong group strategyproofness. We then identify a necessary condition for weak group strategypro...

متن کامل

Group Strategyproofness and No Subsidy via LP-Duality

We make two contributions to cooperative game theory, both of which rely heavily on linear programming duality theory. First, we introduce a fairness criterion on service providers, which we call No Subsidy. This condition ensures that a subset of the users is not overcharged in order to subsidize another set of users. We completely characterize cost functions that allow cost sharing mechanisms...

متن کامل

Fairness and group-strategyproofness clash in assignment problems

No group-strategyproof and ex-post Pareto optimal randommatching mechanism treats equals equally. Every mechanism that arises out of the randomization over a set of non-bossy and strategyproof mechanisms is non-bossy. Random serial dictatorship, which arises out of the randomization over deterministic serial dictatorships is non-bossy but not group-strategyproof.

متن کامل

Approximate Strategyproofness

The standard approach of mechanism design theory insists on equilibrium behavior by participants. This assumption is captured by imposing incentive constraints on the design space. But in bridging from theory to practice, it often becomes necessary to relax incentive constraints in order to allow tradeo↵s with other desirable properties. This paper surveys a number of different options that can...

متن کامل

Partial Strategyproofness: An Axiomatic Approach to Relaxing Strategyproofness for Random Assignment Mechanisms

In this paper, we present a new relaxed notion of strategyproofness to study the incentive properties of non-strategyproof random assignment mechanisms. To this end, we first prove a new decomposition of full strategyproofness into three axioms: swap monotonicity, upper invariance, and lower invariance. By dropping the lower invariance axiom we obtain partially strategyproof mechanisms, which r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Economics

سال: 2021

ISSN: ['1555-7561', '1933-6837']

DOI: https://doi.org/10.3982/te4229